منابع مشابه
A note on k-shortest paths problem
It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this paper, we generalize this to shortest k edge-disjoint s-t paths for any positive integer k.
متن کاملNote on the Projective Geometry of Paths.
2. Projective Tensors. Theorems of the projective geometry of paths appear to have their statement in terms of what may be called projective tensors, i. e. tensors which are independent of the particular set of functions T\^ defining the paths. We shall show how a set of projective tensors may be derived by covariant differentiation from an w-uple of mutually independent vectors. Let h(a)i deno...
متن کامل0 A note on extended complex manifolds
We introduce a category of extended complex manifolds, and prove that the func-tor describing deformations of a classical compact complex manifold M within this category is versally representable by (an analytic subspace in) H * (M, T M). By restricting the associated versal family of extended complex manifolds over H * (M, T M) to the subspace H 1 (M, T M) one gets a correct limit to the class...
متن کامل0 A note on holomorphic extensions
We give a criterium of holomorphy for some type formal power series. This gives a stronger form of a Rothstein's type extension theorem for a particular ring of holomorphic functions. We consider the set R ⊂ C[[z 1 , z 2 ]], z 1 , z 2 ∈ C k × C m of formal power series of the form f (z) = f (z 1 , z 2) = n P n (z 2)z n 1 where P n is a polynomial in m variables of total degree d 0 P n ≤ C 0 + C...
متن کاملA note on packing paths in planar graphs
P.D. Seymour proved that the cut criterion is necessary and suucient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, M. Middendorf and F. Pfeiier proved the problem to be NP-complete. For this case E. Korach and M. Penn proved that the cut criterion is suucient for the existen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1973
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1973-0311468-7